Quantum Factoring and Search Algorithms
نویسنده
چکیده
Quantum Factoring and Search Algorithms Quantum Information Seminar Friday, Sep. 17, 1999 Ashok Muthukrishnan Rochester Center for Quantum Information (RCQI) ___________________________________________________________ § 1. Quantum Algorithm for Factorisation (1994) A. Factorising and cryptography p. 2 B. Relation of factorisation to period-finding p. 5 C. Quantum algorithm for period-finding p. 6 D. Efficiency of the period-finding algorithm p. 13
منابع مشابه
Lecture Notes in Computer Science 4910
Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on ”glued trees” graph. In this talk, I will describe the quantum walk method for designing search...
متن کاملNew Developments in Quantum Algorithms
In this talk, we describe two recent developments in quantum algorithms. The first new development is a quantum algorithm for evaluating a Boolean formula consisting of AND and OR gates of size N in time O( √ N). This provides quantum speedups for any problem that can be expressed via Boolean formulas. This result can be also extended to span problems, a generalization of Boolean formulas. This...
متن کاملSymbolic Arithmetic and Integer Factorization
In this paper, we create a systematic and automatic procedure for transforming the integer factorization problem into the problem of solving a system of Boolean equations. Surprisingly, the resulting system of Boolean equations takes on a ”life of its own” and becomes a new type of integer, which we call a generic integer. We then proceed to use the newly found algebraic structure of the ring o...
متن کاملEntanglement purification with two-way classical communication
Quantum information theory and quantum computation study the use of quantum physics in information processing and computation[1]. Many important results such as quantum teleportation, superdense coding, factoring and search algorithms make use of quantum entanglements as fundamental resources [2, 3, 4, 5]. Therefore, entanglement purification protocols, the procedures by which we extract pure-s...
متن کاملS Is Quantum Search Practical? Q U a N T U M C O M P U T I N G
sive speedups in computing by exploiting quantum-mechanical effects such as superposition (quantum parallelism) and entanglement.1 A quantum algorithm typically consists of applying quantum gates to quantum states, but because the input to the algorithm might be normal classical bits (or nonquantum), it only affects the selection of quantum gates. After all the gates are applied, quantum measur...
متن کامل